Program analysis via graph reachability
نویسندگان
چکیده
منابع مشابه
Program Analysis via Graph Reachability
This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems. Some of the program-analysis problems that are amenable to this treatment include program slicing, certain dataflow-analysis problems, and the problem of approximating the possible "shapes" that heap-allocated structures in a program can take on. Relationships betwee...
متن کاملInterprocedural Dataflow Analysis via Graph Reachability
This paper shows how a large class of interprocedural dataflow-analysis problems can be solved precisely in polynomial time. The only restrictions are that the set of dataflow facts is a finite set, and that the dataflow functions distribute over the confluence operator (either union or intersection). This class of problems includes—but is not limited to—the classical separable problems (also k...
متن کاملPrecise Interprocedural Dataflow Analysis via Graph Reachability ( Extended
This paper shows how to find precise solutions to a large class of interprocedural dataflow-analysis problems in polynomial time. In contrast with intraprocedural dataflow analysis, where “precise” means “meet-over-all-paths”[16], a precise interprocedural dataflow-analysis algorithm must provide the “meet-over-all-valid-paths” solution. (A path is valid if it respects the fact that when a proc...
متن کاملReachability Analysis on Timed Graph Transformation Systems
In recent years, software increasingly exhibits self-* properties like selfoptimization or self-healing. Such properties require reconfiguration at runtime in order to react to changing environments or detected defects. A reconfiguration might add or delete components as well as it might change the communication topology of the system. Considering communication protocols between an arbitrary nu...
متن کاملReachability Analysis via Face Lifting
In this paper we discuss the problem of calculating the reach able states of a dynamical system de ned by ordinary di erential equa tions or inclusions We present a prototype system for approximating this set and demonstrate some experimental results
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Software Technology
سال: 1998
ISSN: 0950-5849
DOI: 10.1016/s0950-5849(98)00093-7